Improvement Algorithm for Limited Space Scheduling
نویسندگان
چکیده
Selecting construction methods, scheduling activities, and planning the use of site space are key to constructing a project efficiently. Site layout and activity scheduling have been tackled as independent problems. Their interdependence is often ignored at the planning stage and may be dealt with—if at all—when construction is underway. Problems that may have had easy solutions if dealt with earlier, may then be expensive to remedy. This paper addresses the combined problem termed ‘‘space scheduling’’ and presents an algorithmic time-space trade-off model for adjusting activity durations and start dates to decrease the need for space over congested time periods. The model characterizes resource space requirements over time and establishes a timespace relationship for each activity in the schedule, based on alternative resource levels. An example illustrates the presented algorithm that generates a feasible space schedule.
منابع مشابه
Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملTrucks Scheduling to Reduce Delays in Multiple Cross-Docks Using Imperialist Competitive Algorithm
Cross docking is a logistics strategy that is now used by a large number of firms in the various industries. Cross docking effectively a significant reduction in transport costs, without increasing inventory and at the same time maintain the level of service to customers. It also can cross dock order to reduce cycle time, improve flexibility and responsiveness lead distribution network. In this...
متن کاملPlanning in a cross dock network with an operational scheduling overview
Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capac...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل